#include "RandomGenerator.h"
#include <string.h>
#include <time.h>

#ifdef _WIN32
static unsigned __int64 getSystemRandom()
{
	return (unsigned __int64)time(0);
}
#else
static unsigned __int64 getSystemRandom()
{
	int randDev = open("/dev/urandom", O_RDONLY);
	unsigned __int64 randValue;
	if (randDev < 0) {
		THError("Unable to open /dev/urandom");
	}
	ssize_t readBytes = read(randDev, &randValue, sizeof(randValue));
	if (readBytes < sizeof(randValue)) {
		THError("Unable to read from /dev/urandom");
	}
	close(randDev);
	return randValue;
}
#endif // _WIN32



// Note: the algorithm here is a port of the Torch7 random generator

UniformGenerator::UniformGenerator()
{
	Reset();
	SetSeed(getSystemRandom());
}

void UniformGenerator::Reset()
{
	this->the_initial_seed = 0;
	this->next = 0;
	memset(this->state, _MERSENNE_STATE_N, 0);

	this->left = 1;
	this->seeded = 0;

	this->normal_is_valid = false;
}


/* The next 4 methods are taken from http:www.math.keio.ac.jpmatumotoemt.html
Here is the copyright:
Some minor modifications have been made to adapt to "my" C... */

/*
A C-program for MT19937, with initialization improved 2002/2/10.
Coded by Takuji Nishimura and Makoto Matsumoto.
This is a faster version by taking Shawn Cokus's optimization,
Matthe Bellew's simplification, Isaku Wada's double version.

Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).

Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:

1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.

2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.

3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


Any feedback is very welcome.
http://www.math.keio.ac.jp/matumoto/emt.html
email: matumoto@math.keio.ac.jp
*/

/* Macros for the Mersenne Twister random generator... */
/* Period parameters */
/* #define n 624 */
/* #define m 397 */
#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
#define UMASK 0x80000000UL /* most significant w-r bits */
#define LMASK 0x7fffffffUL /* least significant r bits */
#define MIXBITS(u,v) ( ((u) & UMASK) | ((v) & LMASK) )
#define TWIST(u,v) ((MIXBITS(u,v) >> 1) ^ ((v)&1UL ? MATRIX_A : 0UL))
/*********************************************************** That's it. */

void UniformGenerator::SetSeed(unsigned __int64 the_seed_)
{
	int j;

	Reset();

	this->the_initial_seed = the_seed_;
	this->state[0] = this->the_initial_seed & 0xffffffffUL;
	for (j = 1; j < _MERSENNE_STATE_N; j++)
	{
		this->state[j] = (1812433253UL * (this->state[j - 1] ^ (this->state[j - 1] >> 30)) + j);
		/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
		/* In the previous versions, mSBs of the seed affect   */
		/* only mSBs of the array state[].                        */
		/* 2002/01/09 modified by makoto matsumoto             */
		this->state[j] &= 0xffffffffUL;  /* for >32 bit machines */
	}
	this->left = 1;
	this->seeded = 1;
}

void UniformGenerator::NextState()
{
	unsigned __int64 *p = this->state;
	int j;

	int n = _MERSENNE_STATE_N;
	int m = _MERSENNE_STATE_M;

	this->left = n;
	this->next = 0;

	for (j = n - m + 1; --j; p++)
		*p = p[m] ^ TWIST(p[0], p[1]);

	for (j = m; --j; p++)
		*p = p[m - n] ^ TWIST(p[0], p[1]);

	*p = p[m - n] ^ TWIST(p[0], this->state[0]);
}

unsigned __int64 UniformGenerator::RandomULong()
{
	unsigned __int64 y;

	if (--(this->left) == 0)
		NextState();
	y = *(this->state + (this->next)++);

	/* Tempering */
	y ^= (y >> 11);
	y ^= (y << 7) & 0x9d2c5680UL;
	y ^= (y << 15) & 0xefc60000UL;
	y ^= (y >> 18);

	return y;
}

/* generates a random number on [0,1)-double-interval */
double UniformGenerator::NextUniform()
{
	/* divided by 2^32 */
	return (double)RandomULong() * (1.0 / 4294967296.0);
}
